A A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems
نویسندگان
چکیده
We investigate the computational complexity of a general “compression task” centrally occurring in the recently developed technique of iterative compression for exactly solving NP-hard minimization problems. The core issue (particularly but not only motivated by iterative compression) is to determine the computational complexity of the following task: given an already inclusion-minimal solution for an underlying (typically NP-hard) vertex deletion problem in graphs, find a smaller disjoint solution. The complexity of this task is so far lacking a systematic study. We consider a large class of vertex deletion problems on undirected graphs and show that a few cases are polynomial-time solvable, and the others are NP-hard. The considered class of vertex deletion problems includes Vertex Cover (where the compression task is polynomial-time) and Undirected Feedback Vertex Set (where the compression task is NP-complete).
منابع مشابه
Vertex Deletion Problems on Chordal Graphs
Containing many classic optimization problems, the family of vertex deletion problems has an important position in algorithm and complexity study. The celebrated result of Lewis and Yannakakis gives a complete dichotomy of their complexity. It however has nothing to say about the case when the input graph is also special. This paper initiates a systematic study of vertex deletion problems from ...
متن کاملParameterized complexity dichotomy for $(r,\ell)$-Vertex Deletion
For two integers r, l ≥ 0, a graph G = (V,E) is an (r, l)graph if V can be partitioned into r independent sets and l cliques. In the parameterized (r, l)-Vertex Deletion problem, given a graph G and an integer k, one has to decide whether at most k vertices can be removed from G to obtain an (r, l)-graph. This problem is NP-hard if r+l ≥ 1 and encompasses several relevant problems such as Verte...
متن کاملCritical Vertices and Edges in $H$-free Graphs
A vertex or edge in a graph is critical if its deletion reduces the chromatic number of the graph by 1. We consider the problems of deciding whether a graph has a critical vertex or edge, respectively. We give a complexity dichotomy for both problems restricted to H-free graphs, that is, graphs with no induced subgraph isomorphic to H. Moreover, we show that an edge is critical if and only if i...
متن کاملOn the complexity of finding internally vertex-disjoint long directed paths
For two positive integers k and `, a (k × `)-spindle is the union of k pairwise internally vertexdisjoint directed paths with ` arcs between two vertices u and v. We are interested in the (parameterized) complexity of several problems consisting in deciding whether a given digraph contains a subdivision of a spindle, which generalize both the Maximum Flow and Longest Path problems. We obtain th...
متن کاملParameterized Algorithms for Deletion to (r, ell)-Graphs
For fixed integers r, l ≥ 0, a graph G is called an (r, l)-graph if the vertex set V (G) can be partitioned into r independent sets and l cliques. This brings us to the following natural parameterized questions: Vertex (r, l)-Partization and Edge (r, l)-Partization. An input to these problems consist of a graph G and a positive integer k and the objective is to decide whether there exists a set...
متن کامل